Genetic Algorithms for Structural Cluster Optimization
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Structural Cluster Optimization
Certain aspects of the methodology of genetic algorithms for global structural optimization of clusters were studied. Through systematic investigations of Lennard-Jones clusters with up to 100 atoms, several modifications were made to the genetic algorithm introduced by Deaven and Ho [Phys. ReV. Lett. 1995, 75, 288]. These modifications result in improved efficiency of the search procedure and ...
متن کاملStructural Optimization of Laminated Plates with Genetic Algorithms
Laminated plate optimization is a combinatorial problem where the objective is to find the optimal sequence of materials from a given set, along with the respective fiber orientation. Due to manufacturing reasons, the size of each ply can only take a discrete number of values and, together with the available materials, results in an integer programming problem. Therefore, an approach based on G...
متن کاملGenetic Algorithms for Model Optimization
An emerging, yet extremely important topic in simulation application and research is simulation optimization. Emphasis in the literature, in professional conferences, and particularly in commercial software packages underscore the importance of simulation optimization. We address this topic in a more general, model optimization venue. In particular we describe the use of a genetic algorithm in ...
متن کاملCluster Analysis and Genetic Algorithms
The paper deals with the cluster analysis and genetic algorithms and describes their basis. The application of genetic algorithms is focused on a cluster analysis as an optimization task. The case studies present the way of solution of two and three dimensional cluster analysis in MATLAB program with use of the Genetic Algorithm and Direct Search Toolbox. The way of its possible use in business...
متن کاملParallel Heterogeneous Genetic Algorithms for Continuous Optimization
In this paper we address the physical parallelization of a very efficient genetic algorithm (GA) known as gradual distributed real-coded GA (GD-RCGA). This search model naturally provides a set of eight subpopulations residing in a cube topology having two faces for promoting exploration and exploitation. The resulting technique has been shown to yield very accurate results in continuous optimi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Physical Chemistry A
سال: 1998
ISSN: 1089-5639,1520-5215
DOI: 10.1021/jp9814597